TSTP Solution File: NUM802^5 by Duper---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Duper---1.0
% Problem : NUM802^5 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : duper %s
% Computer : n011.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Aug 31 10:57:49 EDT 2023
% Result : Theorem 3.91s 4.09s
% Output : Proof 3.91s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : NUM802^5 : TPTP v8.1.2. Released v4.0.0.
% 0.12/0.13 % Command : duper %s
% 0.13/0.34 % Computer : n011.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Fri Aug 25 08:32:08 EDT 2023
% 0.13/0.35 % CPUTime :
% 3.91/4.09 SZS status Theorem for theBenchmark.p
% 3.91/4.09 SZS output start Proof for theBenchmark.p
% 3.91/4.09 Clause #0 (by assumption #[]): Eq
% 3.91/4.09 (Not
% 3.91/4.09 (c_less_ c_2 c0 →
% 3.91/4.09 (∀ (Xu Xv : Iota), c_less_ Xu c0 → Ne Xu (absval Xv)) →
% 3.91/4.09 Exists fun A => And (∀ (Xy : Iota), Not (A (absval Xy))) (A c_2)))
% 3.91/4.09 True
% 3.91/4.09 Clause #1 (by clausification #[0]): Eq
% 3.91/4.09 (c_less_ c_2 c0 →
% 3.91/4.09 (∀ (Xu Xv : Iota), c_less_ Xu c0 → Ne Xu (absval Xv)) →
% 3.91/4.09 Exists fun A => And (∀ (Xy : Iota), Not (A (absval Xy))) (A c_2))
% 3.91/4.09 False
% 3.91/4.09 Clause #2 (by clausification #[1]): Eq (c_less_ c_2 c0) True
% 3.91/4.09 Clause #3 (by clausification #[1]): Eq
% 3.91/4.09 ((∀ (Xu Xv : Iota), c_less_ Xu c0 → Ne Xu (absval Xv)) →
% 3.91/4.09 Exists fun A => And (∀ (Xy : Iota), Not (A (absval Xy))) (A c_2))
% 3.91/4.09 False
% 3.91/4.09 Clause #4 (by clausification #[3]): Eq (∀ (Xu Xv : Iota), c_less_ Xu c0 → Ne Xu (absval Xv)) True
% 3.91/4.09 Clause #5 (by clausification #[3]): Eq (Exists fun A => And (∀ (Xy : Iota), Not (A (absval Xy))) (A c_2)) False
% 3.91/4.09 Clause #6 (by clausification #[4]): ∀ (a : Iota), Eq (∀ (Xv : Iota), c_less_ a c0 → Ne a (absval Xv)) True
% 3.91/4.09 Clause #7 (by clausification #[6]): ∀ (a a_1 : Iota), Eq (c_less_ a c0 → Ne a (absval a_1)) True
% 3.91/4.09 Clause #8 (by clausification #[7]): ∀ (a a_1 : Iota), Or (Eq (c_less_ a c0) False) (Eq (Ne a (absval a_1)) True)
% 3.91/4.09 Clause #9 (by clausification #[8]): ∀ (a a_1 : Iota), Or (Eq (c_less_ a c0) False) (Ne a (absval a_1))
% 3.91/4.09 Clause #10 (by destructive equality resolution #[9]): ∀ (a : Iota), Eq (c_less_ (absval a) c0) False
% 3.91/4.09 Clause #11 (by clausification #[5]): ∀ (a : Iota → Prop), Eq (And (∀ (Xy : Iota), Not (a (absval Xy))) (a c_2)) False
% 3.91/4.09 Clause #12 (by clausification #[11]): ∀ (a : Iota → Prop), Or (Eq (∀ (Xy : Iota), Not (a (absval Xy))) False) (Eq (a c_2) False)
% 3.91/4.09 Clause #13 (by clausification #[12]): ∀ (a : Iota → Prop) (a_1 : Iota), Or (Eq (a c_2) False) (Eq (Not (Not (a (absval (skS.0 0 a a_1))))) True)
% 3.91/4.09 Clause #14 (by clausification #[13]): ∀ (a : Iota → Prop) (a_1 : Iota), Or (Eq (a c_2) False) (Eq (Not (a (absval (skS.0 0 a a_1)))) False)
% 3.91/4.09 Clause #15 (by clausification #[14]): ∀ (a : Iota → Prop) (a_1 : Iota), Or (Eq (a c_2) False) (Eq (a (absval (skS.0 0 a a_1))) True)
% 3.91/4.09 Clause #24 (by superposition #[15, 2]): ∀ (a : Iota), Or (Eq ((fun x => c_less_ x c0) (absval (skS.0 0 (fun x => c_less_ x c0) a))) True) (Eq False True)
% 3.91/4.09 Clause #29 (by betaEtaReduce #[24]): ∀ (a : Iota), Or (Eq (c_less_ (absval (skS.0 0 (fun x => c_less_ x c0) a)) c0) True) (Eq False True)
% 3.91/4.09 Clause #30 (by clausification #[29]): ∀ (a : Iota), Eq (c_less_ (absval (skS.0 0 (fun x => c_less_ x c0) a)) c0) True
% 3.91/4.09 Clause #31 (by superposition #[30, 10]): Eq True False
% 3.91/4.09 Clause #38 (by clausification #[31]): False
% 3.91/4.09 SZS output end Proof for theBenchmark.p
%------------------------------------------------------------------------------